A Recursive Method for Traffic Management through a Complex Path Network
نویسندگان
چکیده
Many simulation models contain one or more transport systems where some type of vehicle, perhaps an AGV, a fork truck, a shuttle, or a human being, travel along predefined paths. Locations along the paths may specify where loads carried by the vehicle transfer to or from it, where some activity takes place requiring the vehicle’s presence, or where vehicle routing logic executes. This paper focuses on the last topic, the routing of vehicles along a path system where alternate paths exist and path selection is determined at so called “routing nodes” based on a dynamic analysis of traffic congestion along each possible route towards some destination. Other routing nodes further along each path present more combinations of possible interim paths. A recursive search algorithm is presented to iteratively evaluate each possible route when a vehicle encounters a routing node. The vehicle is directed along a path with the least overall congestion towards its destination. A sample model demonstrating this algorithm implemented in the AutoMod software is used for illustration. Other simulation products may have the features to support this type of vehicle routing control algorithm. 1 AUTOMOD’S PATH MOVER SYSTEM The AutoMod simulation software contains a material handling system called the Path Mover, in which vehicles move along guidepath, carrying loads from pickup locations to delivery locations (called “control points”). Path Mover vehicles can represent manually operated lift trucks, people, or computer-controlled vehicles (any type of movement system in which vehicles follow a specific path or route). By default, AutoMod vehicles in a Path Mover system use the shortest route between load pickup and delivery points. Where intersections offering more than one path segment to another control point exist, the default routing can be over-ridden by using a built-in “location selection function”. This function defines the next control point a vehicle claims in its route, or if the next path segment is blocked, the transfer (a construct automatically inserted by AutoMod at path intersections) may offer an alternate path. 1.1 Location Selection Function Path Mover vehicles automatically call the location selection function each time they have a choice of determining the next control point to claim on the way to their destination. The function provides the opportunity to select from a list of subsequent control points to the current location and returns the control point to which the vehicle will travel next (returning null from the function will direct the vehicle to take the shortest route to its destination, the default). The location selection function is a convenient way to make local decisions for vehicle routing. begin pm location selection function choose a location from among theLocList whose remaining space is maximum save choice as Vchoiceloc return Vchoiceloc
منابع مشابه
Design of an Intelligent Controller for Station Keeping, Attitude Control, and Path Tracking of a Quadrotor Using Recursive Neural Networks
During recent years there has been growing interest in unmanned aerial vehicles (UAVs). Moreover, the necessity to control and navigate these vehicles has attracted much attention from researchers in this field. This is mostly due to the fact that the interactions between turbulent airflows apply complex aerodynamic forces to the system. Since the dynamics of a quadrotor are non-linear and the ...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملBehavioral Analysis of Traffic Flow for an Effective Network Traffic Identification
Fast and accurate network traffic identification is becoming essential for network management, high quality of service control and early detection of network traffic abnormalities. Techniques based on statistical features of packet flows have recently become popular for network classification due to the limitations of traditional port and payload based methods. In this paper, we propose a metho...
متن کاملIntelligent Traffic Management System for Prioritizing Emergency Vehicles in a Smart City (TECHNICAL NOTE)
Traffic congestion worldwide has led to loss of human lives due to failure in transporting accident victims, critical patients, medical equipment and medicines on time. With the unending growth in vehicular traffic everywhere, Internet of Things (IOT) and Vehicular Ad Hoc Network (VANET) have embarked as a promising platform for an Intelligent Traffic Management System (ITMS). Many researches h...
متن کاملClassification of encrypted traffic for applications based on statistical features
Traffic classification plays an important role in many aspects of network management such as identifying type of the transferred data, detection of malware applications, applying policies to restrict network accesses and so on. Basic methods in this field were using some obvious traffic features like port number and protocol type to classify the traffic type. However, recent changes in applicat...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کامل